Modular, higher order cardinality analysis in theory and practice

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

In submission Modular , Higher - Order Cardinality Analysis in Theory and Practice

Since the mid 80's, compiler writers for functional languages (especially lazy ones) have been writing papers about identifying and exploiting thunks and lambdas that are used only once. However it has proved difficult to achieve both power and simplicity in practice. We describe a new, modular analysis for a higher-order language , which is both simple and effective, and present measurements o...

متن کامل

In submission Modular , Higher - Order Cardinality Analysis in Theory and Practice

Since the mid 80's, compiler writers for functional languages (especially lazy ones) have been writing papers about identifying and exploiting thunks and lambdas that are used only once. However it has proved difficult to achieve both power and simplicity in practice. We describe a new, modular analysis for a higher-order language , which is both simple and effective, and present measurements o...

متن کامل

Modular, Higher-Order Cardinality Analysis in Theory and Practice Extended version

Since the mid ’80s, compiler writers for functional languages (especially lazy ones) have been writing papers about identifying and exploiting thunks and lambdas that are used only once. However it has proved difficult to achieve both power and simplicity in practice. We describe a new, modular analysis for a higher-order language, which is both simple and effective, and present measurements of...

متن کامل

Theory and Practice of Minimal Modular Higher-Order E-Unification

Modular higher-order E-uniication, as described in 6], produces numerous redundant solutions in many practical cases. We present a reened algorithm for nitary theories with a nite number of non-free constants that avoids most redundant solutions, analyse it theoretically, and give rst experimental results. In comparison to 6], the description of the E-uniication algorithm is enriched by a deeni...

متن کامل

Higher - Order Cardinality Analysis Extended version

Since the mid 80’s, compiler writers for functional languages (especially lazy ones) have been writing papers about identifying and exploiting thunks and lambdas that are used only once. However it has proved difficult to achieve both power and simplicity. We describe a new, modular analysis for a higher-order language, which is both simple and effective, and present measurements of its use in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Programming

سال: 2017

ISSN: 0956-7968,1469-7653

DOI: 10.1017/s0956796817000016